Approximation Algorithms for the Weighted Independent Set Problem
نویسندگان
چکیده
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and average degree. In weighted case, no corresponding results are given for average degree. It is not appropriate that we analyze weighted independent set algorithms in terms of average degree, since inserting the vertices with small weight decreases average degree arbitrarily without significantly changing approximation ratio. In this paper, we introduce the “weighted” average degree and “weighted” inductiveness, and analyze algorithms for the weighted independent set problem in terms of these parameters.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملApproximation algorithms for the weighted independent set problem in sparse graphs
The approximability of the unweighted independent set problem has been analyzed in terms of sparseness parameters such as the average degree and inductiveness. In the weighted case, no corresponding results are possible for average degree, since adding vertices of small weight can decrease the average degree arbitrarily without significantly changing the approximation ratio. In this paper, we i...
متن کاملApproximation Algorithms for Independent Set Problems on Hypergraphs
This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, local search and partitioning algorithms. We introduce a general technique, called shrinkage reducti...
متن کاملMaximum-Weighted λ-Colorable Subgraph: Revisiting and Applications
Given a vertex-weighted graph G and a positive integer λ, a subset F of the vertices is said to be λ-colorable if F can be partitioned into at most λ independent subsets. This problem of seeking a λ-colorable F with maximum total weight is known as MaximumWeighted λ-Colorable Subgraph (λ-MWCS). This problem is a generalization of the classical problem Maximum-Weighted Independent Set (MWIS) and...
متن کاملDistributed algorithms for weighted problems in sparse graphs
We study distributed algorithms for three graph-theoretic problems in weighted trees and weighted planar graphs. For trees, we present an efficient deterministic distributed algorithm which finds an almost exact approximation of a maximum-weight matching. In addition, in the case of trees, we show how to approximately solve the minimum-weight dominating set problem. For planar graphs, we presen...
متن کامل